Recursive Projected Modified Compressed Sensing for Undersampled Measurements
نویسندگان
چکیده
We study the problem of recursively reconstructing a time sequence of sparse vectors St from measurements of the form Mt = ASt+BLt where A and B are known measurement matrices, and Lt lies in a slowly changing low dimensional subspace. We assume that the signal of interest (St) is sparse, and has support which is correlated over time. We introduce a solution which we call Recursive Projected Modified Compressed Sensing (ReProMoCS), which exploits the correlated support change of St. We show that, under weaker assumptions than previous work, with high probability, ReProMoCS will exactly recover the support set of St and the reconstruction error of St is upper bounded by a small time-invariant value. A motivating application where the above problem occurs is in functional MRI imaging of the brain to detect regions that are “activated” in response to stimuli. In this case both measurement matrices are the same (i.e. A = B). The active region image constitutes the sparse vector St and this region changes slowly over time. The background brain image changes are global but the amount of change is very little and hence it can be well modeled as lying in a slowly changing low dimensional subspace, i.e. this constitutes Lt.
منابع مشابه
Efficient Blind Compressed Sensing Using Sparsifying Transforms with Convergence Guarantees and Application to MRI
Natural signals and images are well-known to be approximately sparse in transform domains such as Wavelets and DCT. This property has been heavily exploited in various applications in image processing and medical imaging. Compressed sensing exploits the sparsity of images or image patches in a transform domain or synthesis dictionary to reconstruct images from undersampled measurements. In this...
متن کاملDeterministic Compressed Sensing Matrices from Additive Character Sequences
Compressed sensing is a novel technique where one can recover sparse signals from the undersampled measurements. In this correspondence, a K×N measurement matrix for compressed sensing is deterministically constructed via additive character sequences. The Weil bound is then used to show that the matrix has asymptotically optimal coherence for N = K, and to present a sufficient condition on the ...
متن کاملBlind Compressed Sensing Enables 3d Dynamic Free Breathing Mr Imaging of Lung Volumes and Diaphragm Motion
Objectives: The objective of this study is to increase the spatial and temporal resolution of dynamic 3D MR imaging of lung volumes and diaphragm motion. To achieve this goal, we evaluate the utility of the proposed blind compressed sensing (BCS) algorithm to recover data from highly undersampled measurements. Materials and Methods: We evaluated the performance of the BCS scheme to recover dyna...
متن کاملImplications in Compressed Sensing and the Restricted Isometry Property
We present a simple method for verifying the restricted isometry property. The results of applying the proposed method are more flexible than that of Candès. In this note, we establish new results about the accuracy of reconstruction from undersampled measurements, which may make it possible to improve estimation.
متن کاملCompressed Sensing: How sharp is the Restricted Isometry Property
Compressed Sensing (CS) seeks to recover an unknown vector with N entries by making far fewer than N measurements; it posits that the number of compressed sensing measurements should be comparable to the information content of the vector, not simply N . CS combines the important task of compression directly with the measurement task. Since its introduction in 2004 there have been hundreds of ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013